The Benefits of State Aggregation with Extreme-Point Weighting for Assemble-to-Order Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact Simulation for Assemble-To-Order Systems

We develop exact simulation (also known as perfect sampling) algorithms for a family of assemble-to-order systems. Due to the finite capacity, and coupling in demands and replenishments, known solving techniques are inefficient for larger problem instances. We first consider the case with individual replenishments of items, and derive an event based representation of the Markov chain that allow...

متن کامل

Optimal Control of Assemble-to-Order Systems

We consider the optimal control of an assemble-to-order (ATO) system with m components, a single end-product, and n customer classes. Demand from each class occurs continuously over time according to a Poisson process. Components are produced in separate production facilities, each with a finite production rate and exponentially distributed production times. Components can be stocked ahead of d...

متن کامل

Replenishment and Fulfillment Based Aggregation for General Assemble-to-Order Systems

We consider an assemble-to-order system with multiple products, multiple components which may be demanded in different quantities by different products, batch ordering of components, random lead times, and lost sales. We model the system as an infinite-horizon Markov decision process under the discounted cost criterion. A control policy specifies when a batch of components should be produced (i...

متن کامل

Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems

Solving Markov chains is in general difficult if the state space of the chain is very large (or infinite) and lacking a simple repeating structure. One alternative to solving such chains is to construct models that are simple to analyze and provide bounds for a reward function of interest. We present a new bounding method for Markov chains inspired by Markov reward theory: Our method constructs...

متن کامل

A Note on Assemble-to-Order Systems with Batch Ordering

We study an assemble-to-order inventory system. The stocks are held for components, with final products assembled only when customer orders are realized. Customer orders form a multivariate compound Poisson process, component replenishment leadtimes are constant, and demands in excess of inventory on hand are backlogged. The component inventories are controlled by (R, nQ) policies. We show that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2018

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.2017.1710